Minimum 2CNF Resolution Refutations in Polynomial Time
نویسندگان
چکیده
We present an algorithm for finding a smallest Resolution refutation of any 2CNF in polynomial time.
منابع مشابه
Minimum Witnesses for Unsatisfiable 2CNFs
We consider the problem of finding the smallest proof of unsatisfiability of a 2CNF formula. In particular, we look at Resolution refutations and at minimum unsatisfiable subsets of the clauses of the CNF. We give a characterization of minimum tree-like Resolution refutations that explains why, to find them, it is not sufficient to find shortest paths in the implication graph of the CNF. The ch...
متن کاملOn the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas
In this paper, we analyze 2CNF formulas from the perspectives of Read-Once resolution (ROR) refutation schemes. We focus on two types of ROR refutations, viz., variable-once refutation and clause-once refutation. In the former, each variable may be used at most once in the derivation of a refutation, while in the latter, each clause may be used at most once. We show that the problem of checking...
متن کاملRandom Resolution Refutations
We study the random resolution refutation system defined in [Buss et al. 2014]. This attempts to capture the notion of a resolution refutation that may make mistakes but is correct most of the time. By proving the equivalence of several different definitions, we show that this concept is robust. On the other hand, if P 6= NP, then random resolution cannot be polynomially simulated by any proof ...
متن کاملOptimal seperation of Treelike and General Resolution PRELIMINARY VERSION
We present the best known separation between tree-like and general resolution, improving on the recent exp(n) separation of BEGJ98]. This is done by constructing a natural family of contradictions, of size n, that have O(n)-size resolution refutations, but only exp(((n= log n))-size tree-like refutations. This result implies that the most commonly used automated theorem procedures, which produc...
متن کاملSmall Stone in Pool
The Stone tautologies are known to have polynomial size resolution refutations and require exponential size regular refutations. We prove that the Stone tautologies also have polynomial size proofs in both pool resolution and the proof system of regular tree-like resolution with input lemmas (regRTI). Therefore, the Stone tautologies do not separate resolution from DPLL with clause learning.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007